A fast persistence-based segmentation of noisy 2D clouds with provable guarantees
نویسندگان
چکیده
منابع مشابه
A fast persistence-based segmentation of noisy 2D clouds with provable guarantees
We design a new fast algorithm to automatically segment a 2D cloud of points into regions. The only input is a dotted image without any extra parameters, say a scanned black-and-white map with almost closed curves or any image with detected edge points. The output is a hierarchy of segmentations into regions whose boundary contours have a long enough life span (persistence) in a sequence of nes...
متن کاملFast Collaborative Filtering from Implicit Feedback with Provable Guarantees
Building recommendation algorithm is one of the most challenging tasks in Machine Learning. Although most of the recommendation systems are built on explicit feedback available from the users in terms of rating or text, a majority of the applications do not receive such feedback. Here we consider the recommendation task where the only available data is the records of user-item interaction over ...
متن کاملHigh-dimensional regression with noisy and missing data: Provable guarantees with non-convexity
Although the standard formulations of prediction problems involve fully-observed and noiseless data drawn in an i.i.d. manner, many applications involve noisy and/or missing data, possibly involving dependence, as well. We study these issues in the context of highdimensional sparse linear regression, and propose novel estimators for the cases of noisy, missing, and/or dependent data. Many stand...
متن کاملAgile Millimeter Wave Networks with Provable Guarantees
There is much interest in integrating millimeter wave radios (mmWave) into wireless LANs and 5G cellular networks to benefit from their multiple GHz of available spectrum. Yet unlike existing technologies, e.g., WiFi, mmWave radios require highly directional antennas. Since the antennas have pencil-beams, the transmitter and receiver need to align their antenna beams before they can communicate...
متن کاملEfficient Steganography with Provable Security Guarantees
We provide a new provably-secure steganographic encryption protocol that is proven secure in the complexity-theoretic framework of Hopper et al. The fundamental building block of our steganographic encryption protocol is a “one-time stegosystem” that allows two parties to transmit one-time steganographic messages of length shorter than the shared key with information-theoretic security guarante...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2016
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2015.11.025